Search for: All records

Dealing with nonlinear effects of the radio-frequency (RF) chain is a key issue in the realization of very large-scale multi-antenna (MIMO) systems. Achieving the remarkable gains possible with massive MIMO requires that the signal processing algorithms systematically take into account these effects. Here, we present a computationally-efficient linear precoding method satisfying the requirements for low peak-to-average power ratio (PAPR) and low-resolution D/Aconverters (DACs). The method is based on a sparse regularization of the precoding matrix and offers advantages in terms of precoded signal PAPR as well as processing complexity. Through simulation, we find that the method substantially improves conventional linear precoders. 

Massive MIMO aims to build wireless base stations with hundreds of coherently operating antennas serving tens of single antenna users in order to improve both the transmission capacity by a factor 10-50 and the energy-efficiency trade-off by up to a thousand times. Pre-coding at the base station has been proposed to efficiently implement digital beamforming. It implies a high signal dynamic range and therefore a power backoff resulting in less energy-efficiency. One-bit quantized Zero-Forcing precoding has been proposed to efficiently handle the RF front-end when the array is implemented with so many antennas. In this paper, we analyze the energy-efficiency of the quantized Zero-Forcing precoded systems for a large number of users and a massive MIMO base station. 

Recently a number of nonlinear precoding algorithms have been developed for designing a downlink transmit signal that is constrained by some nonlinearity, such as one-bit quantization, power-amplifier saturation or constant modulus. These methods use iterative search algorithms to directly design the signal that is transmitted from each antenna. Since the dimension of the search space equals the number of antennas, the computational complexity of these approaches can be high for massive MIMO scenarios. Thus, in this paper we pose the problem in a smaller dimensional space by constraining the signal prior to the nonlinearity to be the output of a linear precoder. The search is then over the vector of predistorted symbols at the input to the linear precoder, which is typically much smaller than the number of antennas. We focus on algorithms that minimize the bit error rate at the receivers, and show that performance can be obtained that is similar to algorithms that operate directly in the antenna domain.